Cryptanalysis of an Enhanced Spatiotemporal Chaotic Image/Video Cryptosystem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91

In this conference, Habutsuu1] suggested a cryptosystem based on iterating a chaotic map. In this paper several properties of this cryptosystem are studied and two cryptanalytic attacks are described.

متن کامل

Cryptanalysis of a New Chaotic Cryptosystem Based on Ergodicity∗

This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosenciphertext attack. Some other design weaknesses are also shown.

متن کامل

Cryptanalysis of a discrete chaotic cryptosystem using external key

In recent years, a growing number of cryptosystems based on chaos have been proposed, many of them fundamentally flawed by a lack of robustness and security. In this Letter, we explain how to break a very recent block cipher algorithm based on the logistic map. This cryptosystem uses a 128-bit external key to derive the initial condition and number of iterations, but in a weak way allowing for ...

متن کامل

Cryptanalysis of Another Knapsack Cryptosystem

At the last Eurocrypt meeting, a cryptosystem based on modular knapsacks was proposed (see [11]). We show that this system is not secure, and we describe two different ways of breaking it using the LLL algorithm. This is one more example of a cryptosystem that can be broken using this powerful algorithm (see [1, 13, 14]). For more details, the reader should refer to [4]. 1 The proposed cryptosy...

متن کامل

Cryptanalysis of the Sidelnikov Cryptosystem

We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effective if the parameters of the Reed-Muller code allow for efficient sampling of minimum weight codewords. For example, the length 2048, 3rd-order Reed-Muller code as proposed in [8] takes roughly an hour to break on a sto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURASIP Journal on Advances in Signal Processing

سال: 2011

ISSN: 1687-6180

DOI: 10.1155/2011/461563